Direct routing: Algorithms and complexity
نویسندگان
چکیده
منابع مشابه
Packet Routing: Complexity and Algorithms
Store-and-forward packet routing belongs to the most fundamental tasks in network optimization. Limited bandwidth requires that some packets cannot move to their destination directly but need to wait at intermediate nodes on their path or take detours. In particular, for time critical applications, it is desirable to find schedules that ensure fast delivery of the packets. It is thus a natural ...
متن کاملReduced complexity compression algorithms for direct-write maskless lithography systems
Hsin-I Liu Vito Dai Avideh Zakhor Borivoje Nikolić University of California, Berkeley Department of Electrical Engineering and Computer Science Berkeley, California E-mail: [email protected] Abstract. Achieving the throughput of one wafer layer per minute with a direct-write maskless lithography system, using 22-nm pixels for 45-nm feature sizes, requires data rates of about 12 Tb/s. In ou...
متن کاملDirect Routing
Direct routing is a special case of bufferless routing in which packets are not allowed to conflict with each other. The task is to compute the injection times of the packets so that they don’t conflict. A well known lower bound on the routing time of any algorithm is Ω(C + D), where the congestion C is the maximum number of paths that use any edge, and the dilation D is the maximum length of a...
متن کاملAlgorithms and complexity
material may be reproduced for any educational purpose, multiple copies may be made for classes, etc. Charges, if any, for reproduced copies must be just enough to recover reasonable costs of reproduction. Reproduction for commercial purposes is prohibited. This cover page must be included in all distributed copies. It may be taken at no charge by all interested persons. Comments and correction...
متن کاملExact Algorithms and Complexity
Over the past couple of decades, a series of exact exponential-time algorithms have been developed with improved run times for a number of problems including IndependentSet, k-SAT, and k-colorability using a variety of algorithmic techniques such as backtracking, dynamic programming, and inclusion-exclusion. The series of improvements are typically in the form of better exponents compared to ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2006
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-005-1189-3